Existence of subgame perfect equilibrium with public randomization: A short proof

نویسندگان

  • Philip J. Reny
  • Arthur J. Robson
چکیده

Consider a multi−stage game where each player has a compact choice set and payoffs are continuous in all such choices. Harris, Reny and Robson (1995) prove existence of a subgame perfect equilibrium as long as a public correlation device is added to each stage. They achieve this by showing that the subgame perfect equilibium path correspondence is upper hemicontinuous. The present paper gives a short proof of existence that focuses on equilibrium payoffs rather than paths. We thank Chris Harris for helpful comments on this proof. Reny gratefully acknowledges support from the National Science Foundation (SES−9905599); Robson from the Social Sciences and Humanities Research Council of Canada. Citation: Reny, Philip J. and Arthur J. Robson, (2002) "Existence of subgame perfect equilibrium with public randomization: A short proof." Economics Bulletin, Vol. 3, No. 24 pp. 1−8 Submitted: October 4, 2002. Accepted: October 11, 2002. URL: http://www.economicsbulletin.com/2002/volume3/EB−02C70016A.pdf

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subgame Perfect Equilibria in Infinite Stage Games: an alternative existence proof

Any stage-game with infinite choice sets can be approximated by finite games obtained as increasingly finer discretizations of the infinite game. The subgame perfect equilibrium outcomes of the finite games converge to a limit distribution. We prove that (i) if the limit distribution is feasible in the limit game, then it is also a subgame perfect equilibrium outcome of the limit game; and (ii)...

متن کامل

Forward Induction and Public Randomization†

We show that if the set of subgame perfect equilibrium payoffs of a stage game is convexified by the introduction of public random variables, then forward induction loses all its power as an argument for refining Nash equilibrium. We establish that our argument does not depend on a convenient choice of off-equilibrium path beliefs. JEL Classification C72

متن کامل

On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games

We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...

متن کامل

Subgame Perfect Equilibria in Stage Games

It is well known that a stage game with infinite choice-sets, unless it contains a public coordination-device in each stage, may have no subgame perfect equilibria. We show that if a game with public coordination-devices has a subgame perfect equilibrium in which two players in each stage use non-atomic strategies, then the game without coordination devices also has a subgame perfect equilibrium.

متن کامل

A Simple Proof of a Theorem by Harris∗

We present a simple proof of existence of subgame perfect equilibria in games with perfect information.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002